Exactly computing bivariate projection depth contours and median

نویسندگان

  • Xiaohui Liu
  • Yijun Zuo
  • Zhizhong Wang
چکیده

Among their competitors, projection depth and its induced estimators are very favorable because they can enjoy very high breakdown point robustness without having to pay the price of low e ciency, meanwhile providing a promising centeroutward ordering of multi-dimensional data. However, their further applications have been severely hindered due to their computational challenge in practice. In this paper, we derive a simple form of the projection depth function, when ( , ) = (Med, MAD). This simple form enables us to extend the existing result of point-wise exact computation of projection depth (PD) of Zuo and Lai (2011) to depth contours and median for bivariate data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient computation of location depth contours by methods of computational geometry

The concept of location depth was introduced as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. The depth contours form a collection of nested polygons, and the center of the deepest contour is called the Tukey median. The only available implemented algor...

متن کامل

Projection - Based Depth Functions and Associated Medians

A class of projection-based depth functions is introduced and studied. These projection-based depth functions possess desirable properties of statistical depth functions and their sample versions possess strong and order √ n uniform consistency. Depth regions and contours induced from projection-based depth functions are investigated. Structural properties of depth regions and contours and gene...

متن کامل

Exact computation of bivariate projection depth and the Stahel-Donoho estimator

The idea of data depth provides a new and promising methodology for multivariate nonparametric analysis. Nevertheless, the computation of data depth and the depth function has remained as a very challenging problem which has hindered the methodology from becoming more prevailing in practice. The same is true for the powerful Stahel–Donoho (S–D) estimator. Here, we present an exact algorithm for...

متن کامل

On the computation of multivariate scenario sets for the skew-t and generalized hyperbolic families

We examine the problem of computing multivariate scenarios sets for skewed distributions. Our interest is motivated by the potential use of such sets in the stress testing of insurance companies and banks whose solvency is dependent on changes in a set of financial risk factors. We define multivariate scenario sets based on the notion of half-space depth (HD) and also introduce the notion of ex...

متن کامل

Proximity graph depth, depth contours, and a new multimodal median

We propose proximity graph depth as a class of depth functions, based on the minimum path length along proximity graph edges to the convex hull of a point set. We analyze the characteristics of several proximity graph depth functions both theoretically and experimentally, define depth contours enclosing regions of increasing depth, and present algorithms for calculating depth values in a point ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2013